Перевод: с английского на русский

с русского на английский

generalized tree

См. также в других словарях:

  • Generalized tree alignment — In computational phylogenetics, generalized tree alignment is the problem of producing a multiple sequence alignment and a phylogenetic tree on a set of sequences simultaneously, as opposed to separately. Formally, Generalized tree alignment is… …   Wikipedia

  • Tree (data structure) — A simple unordered tree; in this diagram, the node labeled 7 has two children, labeled 2 and 6, and one parent, labeled 2. The root node, at the top, has no parent. In computer science, a tree is a widely used data structure that emulates a… …   Wikipedia

  • Tree traversal — Graph and tree search algorithms Alpha beta pruning A* B* Beam Bellman–Ford algorithm Best first Bidirectional …   Wikipedia

  • Phylogenetic tree — ptree redirects here. For Patricia tree, see Radix tree …   Wikipedia

  • Segment tree — In computer science, a segment tree is a tree data structure for storing intervals, or segments. It allows querying which of the stored segments contain a given point. It is, in principle, a static structure; that is, its content cannot be… …   Wikipedia

  • Hilbert R-tree — Hilbert R tree, an R tree variant, is an index for multidimensional objects like lines, regions, 3 D objects, or high dimensional feature based parametric objects. It can be thought of as an extension to B+ tree for multidimensional objects.The… …   Wikipedia

  • Interval tree — In computer science, an interval tree, also called a segment tree or segtree, is an ordered tree data structure to hold intervals. Specifically, it allows one to efficiently find all intervals that overlap with any given interval or point. It is… …   Wikipedia

  • Steiner tree — The Steiner tree problem, named after Jakob Steiner, is a problem in combinatorial optimization.The Steiner tree problem is superficially similar to the minimum spanning tree problem: given a set V of points (vertices), interconnect them by a… …   Wikipedia

  • H tree — Not to be confused with Htree, a Linux filesystem indexing structure. The first ten levels of an H tree The H tree (so called because its first two steps resemble the letter H ) is a family of fractal sets whose Hausdorff dimension is equal to 2 …   Wikipedia

  • Aronszajn tree — In set theory, an Aronszajn tree is an uncountable tree with no uncountable branches and no uncountable levels. For example, every Suslin tree is an Aronszajn tree. More generally, for a cardinal kappa;, a kappa; Aronszajn tree is a tree of… …   Wikipedia

  • Euclidean minimum spanning tree — The Euclidean minimum spanning tree or EMST is a minimum spanning tree of a set of points in the plane (or more generally in Bbb{R}^n), where the weight of the edge between each pair of points is the distance between those two points. In simpler… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»